A new study for fault-tolerant real-time dynamic scheduling algorithms
نویسندگان
چکیده
Many time-critical applications require predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. Failures can happen either due to processor faults or due to task errors. To tolerate both processor and task failures, the copies of every task have to be mutually excluded in space and also in time in the schedule. We assume that each task has two versions, namely, primary copy and backup copy. We believe that the position of the backup copy in the task queue with respect to the position of the primary copy (distance) is a crucial parameter which aaects the performance of any fault-tolerant dynamic scheduling algorithm. To study the eeect of distance parameter, we make fault-tolerant extensions to the well-known myopic scheduling algorithm 3] which is a dynamic scheduling algorithm capable of handling resource constraints among tasks. We have conducted an extensive simulation to study the eeect of distance parameter on the schedulability of fault-tolerant myopic scheduling algorithm.
منابع مشابه
DHARMA : A Tool for Evaluating Dynamic Scheduling
A majority of today's real-time systems assume a priori knowledge of task characteristics and hence are based on static designs which contribute to their high cost and innexibility. The next generation hard real-time systems must be designed to be dynamic and exible. This provides the motivation to study various dynamic scheduling proposals. In this paper, we propose new algorithms for scheduli...
متن کاملEfficient fault tolerant Scheduling techniques And Backup Overloading techniques For Real Time System
To provide the performance analysis of off-line scheduling algorithms which address the issues of fault tolerance, reliability, real-time, task precedence constraints and heterogeneity in real time systems. The performance measures of these algorithms on which they are differentiated on each other are performance, reliability, schedulability. To compare the performance of backup overloading tec...
متن کاملPerformance Evaluation of Integrated Fault-Tolerant Technique: Simulation Study
In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient integrated fault-tolerant technique for ultra-reliable execution of tasks where both hardware (processors and communication channels) and software failures, and on-l...
متن کاملEvaluation of Hft Technique Performance Using Task-scheduling Algorithms
In earlier work we have introduced an efficient hardware fault-tolerant approach for reliable execution of tasks. The proposed approach called the Hardware Fault-Tolerant (HFT) approach. Also, we have introduced the concept of dynamic group maximum matching, which is used to group nodes of a graph into disjoint groups with different sizes dynamically. Furthermore, we have proposed the Dynamic G...
متن کاملAnalysis of Selective Fault - Tolerant , Hard Real - Time
An increasing number of applications are demanding real-time performance from their multiprocessor systems. For many of these applications, a failure may produce disastrous results. Such failures are avoided in hard real-time systems by the use of fault-tolerance. In hard real-time multiprocessor scheduling, this fault tolerance may be provided by including several task backups in each schedule...
متن کامل